The Maximal Length of a k-Separator Permutation

نویسنده

  • Benjamin Gunby
چکیده

A permutation σ ∈ Sn is a k-separator if all of its patterns of length k are distinct. Let F (k) denote the maximal length of a k-separator. Hegarty (2013) showed that k + ⌊√ 2k − 1 ⌋ − 1 6 F (k) 6 k + ⌊√ 2k − 3 ⌋ , and conjectured that F (k) = k + ⌊√ 2k − 1 ⌋ − 1. This paper will strengthen the upper bound to prove the conjecture for all sufficiently large k (in particular, for all k > 320801).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Permuting Sparse Square Matrices into Block Diagonal Form with Overlap

In this whitepaper, we describe the problem of permuting sparse square matrices into block diagonal form with overlap (BDO) and propose a graph partitioning algorithm for solving this problem. A block diagonal matrix with overlap is a block diagonal matrix whose consecutive diagonal blocks may overlap. The objective in this permutation problem is to minimize the total overlap size, whereas the ...

متن کامل

On Square-Free Permutations

A permutation is square-free if it does not contain two consecutive factors of length more than one that coincide in the reduced form (as patterns). We prove that the number of square-free permutations of length n is nn(1−εn) where εn → 0 when n → ∞. A permutation of length n is crucial with respect to squares if it avoids squares but any extension of it to the right, to a permutation of length...

متن کامل

Maximal Fillings of Moon Polyominoes, Simplicial Complexes, and Schubert Polynomials

We exhibit a canonical connection between maximal (0, 1)-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity result for Schubert polynomials. Mor...

متن کامل

The Fischer-Clifford matrices and character table of the maximal subgroup $2^9{:}(L_3(4){:}S_3)$ of $U_6(2){:}S_3$

The full automorphism group of $U_6(2)$ is a group of the form $U_6(2){:}S_3$. The group $U_6(2){:}S_3$ has a maximal subgroup $2^9{:}(L_3(4){:}S_3)$ of order 61931520. In the present paper, we determine the Fischer-Clifford matrices (which are not known yet) and hence compute the character table of the split extension $2^9{:}(L_3(4){:}S_3)$.

متن کامل

Measuring Post–Quickselect Disorder

This paper deals with the amount of disorder that is left in a permutation after one of its elements has been selected with quickselect with or without median-of-three pivoting. Five measures of disorder are considered: inversions, cycles of length less than or equal to some m, cycles of any length, expected cycle length, and the distance to the identity permutation. “Grand averages” for each m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2014